Maze problem is a classical problem in graph theory and other fields. 迷宫问题是图论等领域中的经典问题。
Finally, the proposed dual model is validated by experiment on maze problem including simple environment and complex environment. 针对迷宫问题的实验表明,该方法能够稳定收敛到最优策略;
Stack, queue, maze problem, expression computing, multi-stack and multi-queue. 堆栈;队列;迷宫问题;表达式计算;多堆栈和多队列。
A Modified Ant Colony Algorithm was Proposed to Solve the Maze Problem 基于改进蚁群算法求解迷宫最优路径
The filling approach to solve the maze problem uses less storage and is more efficient than the recall approach. 与传统的“回溯”法相比,用填充法解决迷宫问题具有节约空间、提高效率的优点。
Solve the Maze Problem with the search principle in the artificial intelligence 用人工智能中的搜索原理解决迷宫问题
New Algorithm for Solving Shortest Path of Maze Problem 迷宫最短路径问题新算法
The Discussion of the Transition of the Problem of Maze to the Problem of Graph 迷宫问题转变成图的问题的讨论
Reconsideration of maze problem 迷宫问题再探
A new solution for maze problem based on eight-direction tracking algorithm 基于八方向跟踪算法的迷宫问题新解
This paper explicates the search principle in the artificial intelligence and the method to solve maze problem, and analyses the thinking of C program and provides the detailed program sentences. 本文采用人工智能中的搜索原理,介绍了求解迷宫问题的基本思想以及实现方法。
A new algorithm is presented for solving the shortest path of maze problem, which is not based on the inefficient recursive backtracking theory of classical algorithm ( DFS-Depth First Search and BFS-Breadth First Search). 提出了求解迷宫最短路径问题的新算法,该算法抛弃了经典算法(深度优先搜索和广度优先搜索)中繁杂低效的递归、回溯思想。
In the process of routing, with the differentia between routing question and maze question, target driven 、 dynamic pace methods etc was used to accelerate the speed of routing and the problem that traditional maze routing algorithms are slow will be solved. 在布线过程中,利用布线问题相对于迷宫问题的不同特点,采用目标驱动、动态步长等方法,从而大大提高布线速度,解决了传统迷宫布线算法速度慢的问题。
The thesis has compared and analysed two kinds of algorithms to maze problem, the width first search algorithm and the depth first search algorithm. 本文在对广度优先迷宫搜索算法和深度优先迷宫搜索算法进行了仔细比较与探讨之后,提出一种新的算法:目标优先法。
A solution for maze problem based on rules of the cellular automata 基于细胞自动机的迷宫问题求解
The maze problem is a classical programing question, Its aim is that to be solved out all routes from entry to exit of the maze by way of computer programming. 迷宫问题是一个经典的程序设计问题,它要求用计算机编程的方法求解出从迷宫的入口到出口的所有路径。
A New Method to Solve Maze Problem by Computer 利用计算机求解迷宫问题的新方法
In the present, the thought of undergraduate is confronted with record-breaking bewilderment and maze. Society practice activity is a kind of important approach that make undergraduate understand society, comprehend the situation of our country, go up ability, solve the problem of thought. 当前,大学生思想面临着空前的困惑与迷惘,社会实践活动是使大学生认识社会、了解国情,增长才干、解决思想问题的重要途径。
With the maze mapping method and the orthogonal mutually exclusive criterion of the critical trap grids, the optimized coding problem of CMG mechanism is transformed into that of vertex coloring problem in graph theory. It is revealed that the working principle of the lock mechanism is combinatorics. 采用迷宫映射方法和关键阱格点互斥的十字叉判据,将CMG机构的编码问题转换为图论中顶点着色问题,揭示了这种锁机构的组合数学原理。